A Notion of Approximation for Systems over Finite Alphabets
نویسنده
چکیده
We consider the problem of approximating plants with discrete sensors and actuators (termed ‘systems over finite alphabets’) by deterministic finite memory systems for the purpose of certified-by-design controller synthesis. We propose a new, control-oriented notion of input/output approximation for these systems, that builds on ideas from robust control theory and behavioral systems theory. We conclude with a brief discussion of the key features of the proposed notion of approximation relative to those of two existing notions of finite state approximation and abstraction.
منابع مشابه
On Initialization of Finite State ⇢/μ Approximations of Systems Over Finite Alphabets
Abstract— In this paper, we revisit the construction of finite state ⇢/μ approximations for systems over finite alphabets. We derive conditions under which the complexity of these approximations can be lowered by simplifying the initialization process, thus reducing the size (cardinality) of their state-space. For instances where this condition is not met, we propose an alternative construction...
متن کاملOutput Observability of Systems Over Finite Alphabets with Linear Internal Dynamics
We consider a class of systems over finite alphabets with linear internal dynamics, finite-valued control inputs and finitely quantized outputs. We motivate the need for a new notion of observability and propose three new notions of output observability, thereby shifting our attention to the problem of state estimation for output prediction. We derive necessary and sufficient conditions for a s...
متن کاملRough approximation operators based on quantale-valued fuzzy generalized neighborhood systems
Let $L$ be an integral and commutative quantale. In this paper, by fuzzifying the notion of generalized neighborhood systems, the notion of $L$-fuzzy generalized neighborhoodsystem is introduced and then a pair of lower and upperapproximation operators based on it are defined and discussed. It is proved that these approximation operators include generalized neighborhood system...
متن کاملRegular Expressions for Languages over Infinite Alphabets
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if it is acceptable by finite-state unification based automaton – a model of computation that is tightly related to other models of automata over infinite alphabets.
متن کاملClassical wavelet systems over finite fields
This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...
متن کامل